排序方式: 共有71条查询结果,搜索用时 25 毫秒
21.
22.
In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013 相似文献
23.
Full‐system testing for large‐scale systems is often infeasible or very costly. Thus, when estimating system reliability, it is desirable to use a method that uses subsystem tests, which are often less expensive and more feasible. This article presents a method for bounding full‐system reliabilities based on subsystem tests and, if available, full‐system tests. The method does not require that subsystems be independent. It accounts for dependencies through the use of certain probability inequalities. The inequalities provide the basis for valid reliability calculations while not requiring independent subsystems or full‐system tests. The inequalities allow for test information on pairwise subsystem failure modes to be incorporated, thereby improving the bound on system reliability. We illustrate some of the properties of the estimates via an example application. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
24.
25.
为了克服传统风险评估中定性分析方法客观性较差等缺点,定义了与仿真信号特征参数一致性相关联的后果系数,对仿真信号风险事件所导致的后果进行了定量分析,并在此基础上提出了基于一致性分析的仿真信号应用风险评估模型,最后给出了该模型应用于舰艇辐射噪声仿真的评估实例。评估实例表明,该模型不仅有助于充分挖掘信号仿真中阶段性数据的有用信息,同时也能为仿真信号的风险评估提供实用工具。 相似文献
26.
传统的脉冲多普勒雷达存在严重的测距测速模糊和盲区效应。考虑在正常脉冲重复间隔(PRI)上叠加一个随机扰动,并把PRI的随机变化巧妙转化为稀疏观测矩阵的受限等距性质,提出的基于压缩感知的随机脉冲重复间隔雷达为全相参动目标检测提供了一种新思路。针对其在实际应用中存在的粗糙损失和杂波干扰两个问题,分别提出了基于局部词典细化的精确测速算法和基于改进优化模型的杂波抑制方法。仿真实验结果表明该方案具有较高的测速精度和较强的杂波抑制性能。 相似文献
27.
Antoon W.J. Kolen Jan Karel Lenstra Christos H. Papadimitriou Frits C.R. Spieksma 《海军后勤学研究》2007,54(5):530-543
In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
28.
29.
30.
简要介绍了自适应旁瓣对消的基本原理。重点研究了自适应旁瓣对消在机载脉冲多普勒雷达中的工程实现方法,该方法打破了自适应旁瓣对消目前只能应用于采用低重脉冲重复周期的脉冲多普勒雷达的限制。通过对自适应旁瓣对消结果的分析,表明该方法完全能够满足现有机载脉冲多普勒雷达抗有源旁瓣干扰的需求。 相似文献